New bounds on the diameter vulnerability of iterated line digraphs
نویسندگان
چکیده
Iterated line digraphs have some good properties in relation to the design of interconnection networks. The diameter vulnerability of a digraph is the maximum diameter of the subdigraphs obtained by deleting a ,xed number of vertices or arcs. This parameter is related to the fault-tolerance of interconnection networks. In this work, we introduce some new parameters in order to ,nd new bounds for the diameter vulnerability of general iterated line digraphs. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Diameter vulnerability of iterated line digraphs in terms of the girth
Iterated line digraphs arise naturally in designing fault tolerant systems. Diameter vulnerability measures the increase in diameter of a digraph when some of its vertices or arcs fail. Thus, the study of diameter vulnerability is a suitable approach to the fault tolerance of a network. In this article we present some upper bounds for diameter vulnerability of iterated line digraphs LkG. Our bo...
متن کاملIndependent Spanning Trees with Small Depths in Iterated Line Digraphs
We show that the independent spanning tree conjecture on digraphs is true if we restrict ourselves to line digraphs. Also, we construct independent spanning trees with small depths in iterated line digraphs. From the results, we can obtain independent spanning trees with small depths in de Bruijn and Kautz digraphs that improve the previously known upper bounds on the depths.
متن کاملIndependence number of iterated line digraphs
In this paper, we deal with the independence number of iterated line digraphs of a regular digraph G. We give pertinent lower bounds and give an asymptotic estimation of the ratio of the number of vertices of a largest independent set of the nth iterated line digraph of G. © 2005 Elsevier B.V. All rights reserved.
متن کاملInduced Broadcasting Algorithms in Iterated Line Digraphs
We propose broadcasting algorithms for line digraphs in the telephone model. The new protocols use a broadcasting protocol for a graph G to obtain a broadcasting protocol for the graph L k (G), the graph obtained by applying k times, the line digraph operation to G. As a consequence improved bounds for the broadcasting time in De Bruijn, Kautz and Wrapped Butterry digraphs are obtained.
متن کاملSequence mixed graphs
A mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures are proven to be useful in the problem of constructing dense graphs or digraphs, and this is related to the degree/diameter problem. Thus, our generalize...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 233 شماره
صفحات -
تاریخ انتشار 2001